Minimal Cut-Generating Functions are Nearly Extreme
نویسندگان
چکیده
We study continuous (strongly) minimal cut generating functions for the model where all variables are integer. We consider both the original Gomory-Johnson setting, as well as a recent extension by Cornuéjols and Yıldız. We show that for any continuous minimal or strongly minimal cut generating function, there exists an extreme cut generating function that approximates the (strongly) minimal function as closely as desired. In other words, the extreme functions are “dense” in the set of continuous (strongly) minimal functions.
منابع مشابه
Cut-Generating Functions for Integer Variables
For an integer linear program, Gomory’s corner relaxation is obtained by ignoring the nonnegativity of the basic variables in a tableau formulation. In this paper, we do not relax these nonnegativity constraints. We generalize a classical result of Gomory and Johnson characterizing minimal cut-generating functions in terms of subadditivity, symmetry, and periodicity. Our result is based on a ne...
متن کاملEquivariant Perturbation in Gomory and Johnson’s Infinite Group Problem. Vi. the Curious Case of Two-sided Discontinuous Minimal Valid Functions
We construct a two-sided discontinuous piecewise linear minimal valid cut-generating function for the 1-row Gomory–Johnson model which is not extreme, but which is not a convex combination of other piecewise linear minimal valid functions. The new function only admits piecewise microperiodic perturbations. We present an algorithm for verifying certificates of non-extremality in the form of such...
متن کاملRecurrence Relations for Moment Generating Functions of Generalized Order Statistics Based on Doubly Truncated Class of Distributions
In this paper, we derived recurrence relations for joint moment generating functions of nonadjacent generalized order statistics (GOS) of random samples drawn from doubly truncated class of continuous distributions. Recurrence relations for joint moments of nonadjacent GOS (ordinary order statistics (OOS) and k-upper records (k-RVs) as special cases) are obtained. Single and product moment gene...
متن کاملOn sublinear inequalities for mixed integer conic programs
This paper studies K-sublinear inequalities, a class of inequalities with strong relations to K-minimal inequalities for disjunctive conic sets. We establish a stronger result on the sufficiency of K-sublinear inequalities. That is, we show that when K is the nonnegative orthant or the second-order cone, K-sublinear inequalities together with the original conic constraint are always sufficient ...
متن کاملCut-Generating Functions and S-Free Sets
We consider the separation problem for sets X that are inverse images of a given set S by a linear mapping. Classical examples occur in integer programming, complementarity problems and other optimization problems. One would like to generate valid inequalities that cut off some point not lying in X , without reference to the linear mapping. Formulas for such inequalities can be obtained through...
متن کامل